Filter Design Problems with Convex Optimization
نویسندگان
چکیده
منابع مشابه
1. FIR Filter Design via Spectral Factorization and Convex Optimization 1 FIR Filter Design via Spectral Factorization and Convex Optimization
We consider the design of nite impulse response (FIR) lters subject to upper and lower bounds on the frequency response magnitude. The associated optimization problems, with the lter coe cients as the variables and the frequency response bounds as constraints, are in general nonconvex. Using a change of variables and spectral factorization, we can pose such problems as linear or nonlinear conve...
متن کاملA convex optimization method to solve a filter design problem
In this paper, we formulate the feasibility problem corresponding to a filter design problem as a convex optimization problem. Combined with a bisection rule this leads to an algorithm of minimizing the design parameter in the filter design problem. A safety margin is introduced to solve the numerical difficulties when solving this type of problems numerically. The numerical experiments illustr...
متن کاملConvex Optimization over Positive Polynomials and Filter Design
Positive polynomial matrices play a fundamental role in systems and control theory: they represent e.g. spectral density functions of stochastic processes and show up in spectral factorizations, robust control and filter design problems. Positive polynomials obviously form a convex set and were recently studied in the area of convex optimization [1, 5]. It was shown in [2, 5] that positive poly...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملInterconnect Design Using Convex Optimization
Two wire sizing formulations for optimizing interconnect are presented. The rst minimizes the delay under wire width constraints, while the second minimizes the wiring area under delay and width constraints. A convex programming formulation is proposed, and an e cient algorithm is used to perform the optimization. Experimental results show that the rst formulation, which has been the prevalent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018916544